Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
نویسندگان
چکیده
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in R by another. We apply this framework to the following problems: (i) hitting hyper-rectangles by points in R; (ii) stabbing connected objects by axis-parallel hyperplanes in R; and (iii) hitting half-planes by points. For both the covering and hitting set versions, we obtain incremental polynomial-time algorithms, provided that the dimension d is fixed.
منابع مشابه
Enumerating Minimal Transversals of Geometric Hypergraphs
We consider the problem of enumerating all minimal hitting sets of a given hypergraph (V,R), where V is a finite set, called the vertex set andR is a set of subsets of V called the hyperedges. We show that, when the hypergraph admits a balanced subdivision, then a recursive decomposition can be used to obtain efficiently all minimal hitting sets of the hypergraph. We apply this decomposition fr...
متن کاملEnumerating minimal dominating sets in chordal bipartite graphs
We show that all minimal dominating sets of a chordal bipartite graph can be generated in incremental polynomial, hence output polynomial, time. Enumeration of minimal dominating sets in graphs is equivalent to enumeration of minimal transversals in hypergraphs. Whether the minimal transversals of a hypergraph can be enumerated in output polynomial time is a well-studied and challenging questio...
متن کاملFaster Algorithms to Enumerate Hypergraph Transversals
A transversal of a hypergraph is a set of vertices intersecting each hyperedge. We design and analyze new exponential-time algorithms to enumerate all inclusion-minimal transversals of a hypergraph. For each fixed k ≥ 3, our algorithms for hypergraphs of rank k, where the rank is the maximum size of a hyperedge, outperform the previous best. This also implies improved upper bounds on the maximu...
متن کاملIdentifying the Minimal Transversals of a Hypergraph and Related Problems
The paper considers two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, and discusses their significance for several search problems in applied computer science. Hypergraph saturation, i.e., given a hypergraph H, decide if every subset of vertices is contained in or contains some edge of H, is shown to be co-NP-complete. A certain subproble...
متن کاملAn average study of hypergraphs and their minimal transversals
In this paper, we study some average properties of hypergraphs and the average complexity of algorithms applied to hypergraphs under different probabilistic models. Our approach is both theoretical and experimental since our goal is to obtain a random model that is able to capture the real-data complexity. Starting from a model that generalizes the Erdös-Renyi model [9, 10], we obtain asymptoti...
متن کامل